A CSP Search Algorithm with Reduced Branching Factor
نویسندگان
چکیده
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for construction of ”theoretical” constraint solvers because it decreases twice the base of the exponent of the upper bound of the search algorithm. We present a solver based on the strategy. The pruning mechanism of the algorithm resembles Forward Checking (FC), therefore we term it 2FC. According to our experimental evaluation, 2FC outperforms FC on graph coloring problems and on non-dense instances of randomly generated
منابع مشابه
Reduced branching-factor algorithms for constraint satisfaction problems
This paper investigates connections between the worst-case complexity of CSP search algorithms and their practical e_ciency. We prove that a well-known search algorithm FC-CBJ together with the Fail-First ordering heuristic has a worst-case complexity of O_((d�1)n) rather than O_(dn), where d and n are the maximal domain size and the number of variables of the given CSP, respectively. This resu...
متن کامل2-Way vs. d-Way Branching for CSP
Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, for domain size d. The schemes are not equivalent, but little is known about their relative power. Here we compare them in terms of how efficiently they can refute an unsatisfiable instance with optimal branching choices, by studying ...
متن کاملSet Branching in Constraint Optimization
Branch and bound is an effective technique for solving constraint optimization problems (COP’s). However, its search space expands very rapidly as the domain sizes of the problem variables grow. In this paper, we present an algorithm that clusters the values of a variable’s domain into sets. Branch and bound can then branch on these sets of values rather than on individual values, thereby reduc...
متن کاملUsing SAT Encodings to Drive CSP Value Ordering Heuristics
In this paper, we address the issue of designing from SAT new value ordering heuristics for CSP. We show that using the direct and support SAT encodings of CSP instances, such heuristics can be naturally derived from the well-known two-sided Jeroslow-Wang heuristic. These heuristics exploit the bi-directionality of constraint supports to give a more comprehensive picture in terms of domain redu...
متن کاملA heuristic based on domain-splitting nogoods from restarts
Inspired by Boolean Satisfiability Problems (SAT), Constraint Satisfaction Problems (CSP) are starting to use restart techniques associated with learning nogoods widely. Recent developments show how to learn nogoods from restarts and that these nogoods are of major importance when solving a CSP. Using a backtracking search algorithm, with domain-splitting branching, nogoods are learned from the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005